Compactly Generating All Satisfying Truth Assignments of a Horn Formula
نویسنده
چکیده
While it was known that all models of a Horn formula can be generated in outputpolynomial time, here we present an explicit algorithm as opposed to the rather vague oracle-scheme suggested in the proof of [6, Thm.4]. It is an instance of some principle of exclusion that compactly (thus not one by one) generates all models of certain Boolean formulae given in CNF. The principle of exclusion can be adapted to generate only the models of weight k. We compare and contrast it with constraint programming, 0, 1 integer programming, and binary decision diagrams.
منابع مشابه
On Horn Envelopes and Hypergraph Transversals
We study the problem of bounding from above and below a given set of bit vectors by the set of satisfying truth assignments of a Horn formula. We point out a rather unexpected connection between the upper bounding problem and the problem of generating all transversals of a hypergraph, and settle several related complexity questions.
متن کاملA Fast Deterministic Algorithm for Formulas That Have Many Satisfying Assignments
How can we find any satisfying assignment for a Boolean formula that has many satisfying assignments? There exists an obvious randomized algorithm for solving this problem: one can just pick an assignment at random and check the truth value of the formula for this assignment, this is iterated until a satisfying assignment occurs. Does there exist a polynomial-time deterministic algorithm that s...
متن کاملA Note on Satisfying Truth-Value Assignments of Boolean Formulas
In this paper we define a class of truth-value assignments, called bounded assignments, using a certain substitutional property. We show that every satisfiable Boolean formula has at least one bounded assignment. This allows us to show that satisfying truthvalue assignments of formulas in USAT can be syntactically defined in the language of classical propositional logic. We also discuss a possi...
متن کاملModels and quantifier elimination for quantified Horn formulas
In this paper, quantified Horn formulas (QHORN) are investigated. We prove that the behavior of the existential quantifiers depends only on the cases where at most one of the universally quantified variables is zero. Accordingly, we give a detailed characterization of QHORN satisfiability models which describe the set of satisfying truth assignments to the existential variables. We also conside...
متن کاملLogical Primes, Metavariables and Satisfiability
For formulas F of propositional calculus I introduce a "metavariable" MF and show how it can be used to define an algorithm for testing satisfiability. MF is a formula which is true/false under all possible truth assignments iff F is satisfiable/unsatisfiable. In this sense MF is a metavariable with the "meaning" 'F is SAT'. For constructing MF a group of transformations of the basic variables ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JSAT
دوره 8 شماره
صفحات -
تاریخ انتشار 2012